Lagrange Inversion: when and how
نویسندگان
چکیده
The aim of the present paper is to show how the Lagrange Inversion Formula (LIF) can be applied in a straight-forward way i) to find the generating function of many combinatorial sequences, ii) to extract the coefficients of a formal power series, iii) to compute combinatorial sums, and iv) to perform the inversion of combinatorial identities. Particular forms of the LIF are studied, in order to simplify the computation steps. Some examples are taken from the literature, but their proof is different from the usual, and others are new.
منابع مشابه
Discretized Adjoint State Time and Frequency Domain Full Waveform Inversion: A Comparative Study
This study derives the discretized adjoint states full waveform inversion (FWI) in both time and frequency domains based on the Lagrange multiplier method. To achieve this, we applied adjoint state inversion on the discretized wave equation in both time domain and frequency domain. Besides, in this article, we introduce reliability tests to show that the inversion is performing as it should be ...
متن کاملLagrange Inversion via Transforms
In [3] we described a technique for solving certain linear operator equations by studying the operator power series de ned by the system. Essential for obtaining explicit solutions is a Lagrange inversion formula for power series with coe¢ cients in an integral domain K. Such a formula can be found in Recursive Matrices and Umbral Calculusby Barnabei, Brini and Nicoletti [1]. J. F. Freemans ...
متن کاملLagrange Inversion and Schur Functions
Macdonald defined an involution on symmetric functions by considering the Lagrange inverse of the generating function of the complete homogeneous symmetric functions. The main result we prove in this note is that the images of skew Schur functions under this involution are either Schur positive or Schur negative symmetric functions. The proof relies on the combinatorics of Lagrange inversion. W...
متن کاملLagrange Inversion Counts 35241-Avoiding Permutations
In a previous paper, we showed that 35241-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a much simpler proof based on Lagrange inversion.
متن کاملLagrange inversion
We give a survey of the Lagrange inversion formula, including different versions and proofs, with applications to combinatorial and formal power series identities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006